A Normal Form for Classical Planning Tasks
نویسندگان
چکیده
We describe transition normal form (TNF) for classical planning tasks, where there is a unique goal state and variables occur in an operator precondition iff they appear in the effect. Tasks can be efficiently converted to TNF, all common planning heuristics are invariant under the transformation, and tasks in normal form are easier to study theoretically.
منابع مشابه
Effects of Textually-Enhanced Reading Tasks and Strategic Pre-Task Planning on Learning English Passive Voice
In the realm of second language acquisition (SLA), task-based language teaching (TBLT) and input enhancement (IE) have been the focus of a great number of studies. However, the idea of investigating the effects of focus on form instruction through input-enhanced tasks along with pre-task planning time as one of the features of task-based language teaching has been rarely explored in the field o...
متن کاملNORMAL FORM SOLUTION OF REDUCED ORDER OSCILLATING SYSTEMS
This paper describes a preliminary investigation into the use of normal form theory for modelling large non-linear dynamical systems. Limit cycle oscillations are determined for simple two-degree-of-freedom double pendulum systems. The double pendulum system is reduced into its centre manifold before computing normal forms. Normal forms are obtained using a period averaging method which is appl...
متن کاملLearning Hierarchical Task Models from Input Traces
We describe HTN-Maker, an algorithm for learning hierarchical planning knowledge in the form of task-reduction methods for Hierarchical Task Networks (HTNs). HTN-Maker takes as input a set of planning states from a classical planning domain and plans that are applicable to those states, as well as a set of semantically-annotated tasks to be accomplished. The algorithm analyzes this semantic inf...
متن کاملUnsolvability Certificates for Classical Planning
The plans that planning systems generate for solvable planning tasks are routinely verified by independent validation tools. For unsolvable planning tasks, no such validation capabilities currently exist. We describe a family of certificates of unsolvability for classical planning tasks that can be efficiently verified and are sufficiently general for a wide range of planning approaches includi...
متن کاملComputing Plans with Control Flow and Procedures Using a Classical Planner
We propose a compilation that enhances a given classical planning task to compute plans that contain control flow and procedure calls. Control flow instructions and procedures allow us to generate compact and general solutions able to solve planning tasks for which multiple unit tests are defined. The paper analyzes the relation between classical planning and structured programming with unit te...
متن کامل